Search results for "Deadline-monotonic scheduling"
showing 3 items of 3 documents
Software-Based EDF Message Scheduling on CAN Networks
2006
In this paper, a CAN-based communication system has been used to transmit data between different kinds of sensors and the drive control of an electrical vehicle. Software-based earliest deadline first (EDF) scheduling has been applied to order the data, making possible that more relevant measures meet with their delivery time and, discarding, if necessary, less relevant ones are discarded. The messages use their time-to-deadline as their priority level. With this mechanism, alongside with the discard of data that has lost its deadline, is it possible to deal with saturated that would require a bus utilization well above 100%.
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
2006
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, pre-emptive, uniprocessor scheduling. In this paper, we present a deadline minimisation method that achieves the maximum reduction. As undertaken in other s…
Scheduling of Real-Time Networks with a Column Generation Approach
2013
We present an algorithm based on column generation for the real-time scheduling problem of allocating periodic tasks to electronic control units in multiple subsystems connected by a global bus. The allocation has to ensure that tasks can be scheduled, and messages between tasks in different subsystems can be transmitted over the global bus and meet their deadlines. Also tasks and messages occurring in a task chain must be scheduled in a way such that the sequence of execution meets their end-to-end deadline. We show that our approach computes the optimal allocation in our model and due to the column generation approach early provides lower bounds on the optimal value.